Closed loop multiple transmit, multiple receive antenna wireless communication system

ABSTRACT

A wireless receiver ( 74 ) for receiving signals from a transmitter ( 72 ). The transmitter comprises a plurality of transmit antennas (TAT 1 ′, TAT 2 ′) for transmitting the signals, which comprise respective independent streams of symbols. Additionally, interference occurs between the respective streams. The receiver comprises a plurality of receive antennas (RAT 1 ′, RAT 2 ′) for receiving the signals as influenced by a channel effect between the receiver and the transmitter. The receiver also comprises circuitry ( 80 ) for multiplying the signals times a conjugate transpose of an estimate of the channel effect and times a conjugate transpose of a linear basis transformation matrix. The receiver also comprises circuitry ( 84 ) for selecting the linear basis transformation matrix from a finite set of linear basis transformation matrices. Lastly, the receiver comprises circuitry ( 88 ) for removing the interference between the respective streams.

CROSS-REFERENCES TO RELATED APPLICATIONS

[0001] This application claims the benefit, under 35 U.S.C. §119(e)(1), of U.S. Provisional Application No. 60/280,693 (TI-32854PS), filed Mar. 30, 2001, and incorporated herein by this reference.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

[0002] Not Applicable.

BACKGROUND OF THE INVENTION

[0003] The present embodiments relate to wireless communications systems and, more particularly, to transmitters and receivers with multiple transmit and multiple receive antennas, respectively.

[0004] Wireless communications are prevalent in business, personal, and other applications, and as a result the technology for such communications continues to advance in various areas. One such advancement includes the use of spread spectrum communications, including that of code division multiple access (“CDMA”) and wideband code division multiple access (“WCDMA”) cellular communications. In such communications, a user station (e.g., a hand held cellular phone) communicates with a base station, where typically the base station corresponds to a “cell.” CDMA communications are by way of transmitting symbols from a transmitter to a receiver, and the symbols are modulated using a spreading code which consists of a series of binary pulses. The code runs at a higher rate than the symbol rate and determines the actual transmission bandwidth. In the current industry, each piece of CDMA signal transmitted according to this code is said to be a “chip,” where each chip corresponds to an element in the CDMA code. Thus, the chip frequency defines the rate of the CDMA code. WCDMA includes alternative methods of data transfer, one being frequency division duplex (“FDD”) and another being time division duplex (“TDD”), where the uplink and downlink channels are asymmetric for FDD and symmetric for TDD. Another wireless standard involves time division multiple access (“TDMA”) apparatus, which also are used by way of example in cellular systems. TDMA communications are transmitted as a a group of packets in a time period, where the time period is divided into slots (i.e., packets) so that multiple receivers may each access meaningful information during a part of that time period. In other words, in a group of receivers, each receiver is designated a slot in the time period, and that slot repeats for each group of successive packets transmitted to the receiver. Accordingly, each receiver is able to identify the information intended for it by synchronizing to the group of packets and then deciphering the time slot corresponding to the given receiver. Given the preceding, CDMA transmissions are receiver-distinguished in response to codes, while TDMA transmissions are receiver-distinguished in response to time slots.

[0005] Since CDMA and TDMA communications are along wireless media, then the travel of those communications can be affected in many ways, and generally these effects are referred to as the channel effect on the communication. For example, consider a transmitter with a single antenna transmitting to a receiver with a single antenna. The transmitted signal is likely reflected by objects such as the ground, mountains, buildings, and other things that it contacts. In addition, there may be other signals that interfere with the transmitted signal. As a result, when the transmitted communication arrives at the receiver, it has been affected by the channel effect. As a result, the originally-transmitted data is more difficult to decipher due to the added channel effect.

[0006] As a result of the channel effect, various approaches have been developed in an effort to reduce or remove that effect from the received signal so that the originally-transmitted data is properly recognized. In other words, these approaches endeavor to improve signal-to-noise ratio (“SNR”), thereby improving other data accuracy measures (e.g., bit error rate (“BER”), frame error rate (“FER”), and symbol error rate (“SER”)). One such approach is referred to in the art as a closed loop system, meaning the receiver feeds back information, relating to the channel effect, to the transmitter so that the transmitter can modify its future transmissions so as to compensate for the channel effect This process repeats so that future changes in the channel effect are again fed back from the receiver to the transmitter, and the transmitter thereafter responds to the updated information relating to the channel effect. Another approach is referred to in the art as an open loop system. In the open loop system, the transmitter also attempts to adjust its transmissions to overcome the channel effect, but the system is termed “open” because there is no feedback from the receiver to the transmitter.

[0007] By way of further background, the wireless art also includes other approaches to assist in symbol recovery in view of the channel effect as well as other signal-affecting factors. One such approach is termed antenna diversity, which refers to using multiple antennas at either the transmitter, receiver, or both. For example, in the prior art, a multiple-antenna transmitter is used to transmit the same data on each antenna, with a single antenna receiver then exploiting the differences in the received signals from the different antennas so as to improve SNR. The approach of using more than one transmit antenna at the transmitter is termed transmit antenna diversity, where similarly using more than one receive antenna at the receiver is termed receive antenna diversity. More recently, antenna diversity has been combined with the need for higher data rate. As a result, multiple antenna transmitters have been devised to transmit different data, that is, the data to be transmitted is separated into different streams, with one transmit antenna transmitting a first stream and another transmit antenna transmitting a second stream that is independent from the first stream, and so forth for each of the multiple transmit antennas. In such a case, the receiver typically includes the same, or a greater, number of antennas as the transmitter. Of course, each receiver antenna receives signals from all of the transmit antennas, and these signals also are affected by respective channel effects. Thus, the receiver operates to exploit the use of its multiple antennas as well as recognizing the use of multiple transmit antennas in an effort to fully recover the independent data streams transmitted by the transmitter.

[0008] One type of multiple transmit antenna and multiple receive antenna system is known in the art as a multi-input multi-output (“MIMO”) system and is shown generally as system 10 in the electrical and functional block diagram of FIG. 1. In the example shown in FIG. 1, system 10 is a CDMA system. System 10 includes a transmitter 12 and a receiver 14. For the sake of convenience, each of transmitter 12 and receiver 14 is discussed separately, below.

[0009] Transmitter 12 receives information bits B_(i) at an input to a channel encoder 16. Channel encoder 16 encodes the information bits B_(i) in an effort to improve raw bit error rate, where various encoding techniques may be used. The encoded output of channel encoder 16 is coupled to the input of an interleaver 18. Interleaver 18 operates with respect to a block of encoded bits and shuffles the ordering of those bits so that the combination of this operation with the encoding by channel encoder 16 exploits the time diversity of the information, and then those bits are output to a modulator 20. Modulator 20 is in effect a symbol mapper in that it converts its input bits to symbols, each designated generally as s_(i). The converted symbols s_(i) may take various known forms, and the symbols s_(i) may represent various information such as user data symbols, pilot symbols, and control symbols. For the sake of illustration, a stream of two such symbols, s₁ followed by s₂, are shown as output by modulator 20. Each symbol s_(i) is coupled to a serial-to-parallel converter 22. In response, serial-to-parallel converter 22 receives the incoming symbols and outputs them in parallel streams along its outputs 22o₁ and 22o₂ to a spreader 24. Spreader 24 modulates each data symbol by combining it with, or multiplying it times, a CDMA spreading sequence which can be a pseudo-noise (“PN”) digital signal or PN code or other spreading codes (i.e., it utilizes spread spectrum technology), and it may be a single code or a multicode approach where in a MIMO system the code(s) is the same for each transmitting antenna. In a single code instance, the different symbol streams to be transmitted by each transmit antenna TAT₁ and TAT₂ is multiplied times the same code. In a multicode instance, each stream output 22o₁ and 22o₂ is further divided into ds streams. Each of the ds streams is multiplied times a different and orthogonal code from a set of ds codes, where the same set of codes applies to each stream output 22o₁ and 22o₂. Also for each set of streams, after the multiplication times the codes, the resulting products are summed and output to a respective one of transmit antennas TAT₁ and TAT₂. In any event, the spreading sequence facilitates simultaneous transmission of information over a common channel by assigning each of the transmitted signals a unique code during transmission. Further, this unique code makes the simultaneously-transmitted signals over the same bandwidth distinguishable at receiver 14 (or other receivers). In any event, the outputs 24o₁ and 24o₂ of spreader 24 are connected to respective transmit antennas TAT₁ and TAT₂. For example, in a total stream S_(T) of spread symbols s₁, s₂, s₃, s₄, spreader 24 outputs a first stream S₁ consisting of spread symbols s₁ and s₃ to transmit antenna TAT₁ and spreader 24 outputs a second stream S₂ consisting of spread symbols s₂ and s₄ to transmit antenna TAT₂.

[0010] Receiver 14 includes a first receive antenna RAT₁ and a second receive antenna RAT₂ for receiving communications from both of transmit antennas TAT₁ and TAT₂. Due to the wireless medium between transmitter 12 and receiver 14, each of receive antennas RAT₁ and RAT₂ receives signals from both of the transmit antennas TAT₁ and TAT₂. To further illustrate this effect, FIG. 1 illustrates a different channel effect value h_(ab) from each transmit antenna to each receive antenna, where the first subscript a designates the receive antenna (i.e., 1 for RAT₁ and 2 for RAT₂), and the second subscript b designates the transmit antenna (i.e., 1 for TAT₁ and 2 for TAT₂). For sake of reference as well as further analysis below, the received signals are designated r₁ and r₂ as received by antennas RAT₁ and RAT₂ respectively. Moreover, given the preceding description of the channel effect, it now may be observed that each of r₁ and r₂ includes the transmitted symbols, as influenced by the channel effects; additionally, a noise element w_(z) also will exist in r₁ and r₂ and, thus, each of these values may be represented according to the following respective Equations 1 and 2, which relate to the receipt of the first symbols s₁ and s₂ from streams S₁ and S₂, respectively:

r ₁ =h ₁₁ s ₁ +h ₁₂ s ₂ +w ₁  Equation 1

r ₂ =h ₂₁ s ₁ +h ₂₂ s ₂ +w ₂  Equation 2

[0011] Thus, Equations 1 and 2 demonstrate that each receive antenna receives a signal having one component pertaining to one transmitted stream (e.g., s₁) and another component pertaining to the other and independently-transmitted stream (e.g., s₂).

[0012] Given the values r₁ and r₂ in Equations 1 and 2, they are connected to a despreader and signal separation block 32. The despreader function of block 32 operates according to known principles, such as by multiplying the CDMA signal times the CDMA code for receiver 14 and resolving any multipaths. In addition, since two separate signals are input, then the signal separation function of block 32 separates these signals into estimates of the transmitted symbol streams S₁ and S₂, and for sake of reference such estimates are shown as Ŝ₁ and Ŝ₂, respectively. In CDMA, the signals may be separated according to various known techniques, such as zero forcing or minimum mean square error, each being either a 1-shot (i.e., linear) or iterative operation, or alternatively a maximum likelihood approach may be implemented. The symbol stream estimates are connected to a parallel-to-serial converter 34, which converts the two parallel streams into a single total estimated symbol stream, Ŝ_(T). The estimated symbol stream is connected to a demodulator 36, which removes the modulation imposed on the signal by modulator 20 of transmitter 12. The output of demodulator 36 is connected to a deinterleaver 38. Deinterleaver 38 performs an inverse of the function of interleaver 18 of transmitter 12, and the output of deinterleaver 38 is connected to a channel decoder 40. Channel decoder 40 further decodes the data received at its input, typically operating with respect to certain error correcting codes, and it outputs a resulting stream of decoded symbols. Finally, the decoded symbol stream output by channel decoder 40 may be received and processed by additional circuitry in receiver 14, although such circuitry is not shown in FIG. 1 so as to simplify the present illustration and discussion.

[0013] From the preceding, it may be observed that MIMO system 10 has as a basic characteristic that it transmits independent data streams to a receiver such as receiver 14. However, each stream interferes with the other, and receiver 14 receives signals that include components from each of the independently-transmitted symbol streams. The advantage of MIMO system 10 is that it can achieve higher data rate for a given modulation scheme, for example because it simultaneously transmits different streams of data along different transmit antennas. Alternatively, MIMO system 10 allows the use of lower order modulation given the data rate requirement. The disadvantage, however, is that greater channel diversity gain may be achieved in other systems.

[0014] Another type of theoretical system proposed in the art is a closed loop system wherein channel information is communicated from a receiver to a transmitter and the transmitter communicates via the channel eigenmodes; such a system is referred to in this document as an eigenmode system and one is shown in electrical and functional block diagram form generally as eigenmode system 50 in FIG. 2. System 50 includes a transmitter 52 and a receiver 54. Within these devices, and for the sake of simplifying the following discussion, portions of transmitter 52 and a receiver 54 are shown to include various of the same or comparable blocks as system 10 in FIG. 1; these blocks therefore use the same reference identifiers in both Figures and the reader is assumed to be familiar with the earlier-described concepts relating to such blocks. Accordingly, the following focuses on those blocks which differ in eigenmode system 50 as compared to system 10, as discussed below.

[0015] Looking to transmitter 52, the symbols are output from serial-to-parallel converter 22, in respective symbols streams, along outputs 22o₁ and 22o₂. Each of outputs 22o₁ and 22o₂ is connected as a first multiplicand to a respective multiplier 56 ₁ and 56 ₂, and each of multipliers 56 ₁ and 56 ₂ receives as a second multiplicand a square root of a power weighting factor p₁ and p₂, respectively. The outputs of multipliers 56 ₁ and 56 ₂ are connected to a matrix multiplication block 58. Matrix multiplication block 58 multiplies the products from multipliers 56 ₁ and 56 ₂ times a matrix U, where U is detailed later after a presentation of the channel effect as characterized by a matrix, H. At this point, for the sake of designation, let the resulting products from matrix multiplication block outputs 58o₁ and 58o₂ be represented as x₁ and x₂,as shown in FIG. 2, and thus in response to the various operations on symbols s₁ and s₂, respectively. The outputs 58o₁ and 58o₂ of matrix multiplication block 58 are connected to spreader 24, after which the spread signals are connected to transmit antennas TAT₃ and TAT₄ for transmission to receiver 54.

[0016] Receiver 54 includes receive antennas RAT₃ and RAT₄ for receiving signals r₁ and r₂ from transmit antennas TAT₃ and TAT₄. These signals are first despread by a despreader 32. Further, in a way comparable to MIMO system 10 and discussed above with respect to Equations 1 and 2, the signals received by each of receive antennas RAT₃ and RAT₄ include components from both of the transmit antennas TAT₃ and TAT₄, as influenced by channel effects h_(ab) from each transmit antenna to each receive antenna. To further explain eigenmode system 50 and the additional processing following despreader 32, let the following matrix H, as shown in Equation 3, include each of these channel effects: $\begin{matrix} {H = \begin{bmatrix} h_{11} & h_{12} \\ h_{21} & h_{22} \end{bmatrix}} & {{Equation}\quad 3} \end{matrix}$

[0017] Further, a vector, r, is now defined to include each of the received signals r₁ and r₂, according to the following Equation 4: $\begin{matrix} {\underset{\_}{r} = {{H\begin{bmatrix} x_{1} \\ x_{2} \end{bmatrix}} + \begin{bmatrix} w_{1} \\ w_{2} \end{bmatrix}}} & {{Equation}\quad 4} \end{matrix}$

[0018] where in Equation 4, H is the channel effect matrix of Equation 3, x₁ and x₂ are the signals transmitted by transmitter 52, and w₁ and w₂ are the noise components in the received signals. Further, let the transmitted signals and noise signals be defined as the vectors in the following Equations 5 and 6: $\begin{matrix} {\underset{\_}{x} = \begin{bmatrix} x_{1} \\ x_{2} \end{bmatrix}} & {{Equation}\quad 5} \\ {\underset{\_}{w} = \begin{bmatrix} w_{1} \\ w_{2} \end{bmatrix}} & {{Equation}\quad 6} \end{matrix}$

[0019] Accordingly, Equation 4 can be re-written in vector form by substituting in the conventions of Equations 5 and 6 to yield the following Equation 7:

r=Hx+w  Equation 7

[0020] Having established the various preceding designations, attention is now returned to additional aspects of receiver 54, after which the preceding Equations are further developed to reflect the overall operation of eigenmode system 50. The signals r₁ and r₂ are connected from receive antennas RAT₃ and RAT₄, through despreader 32, to a matched filter block 60. Matched filter block 60 multiplies these incoming signals times a matrix that represents a conjugate transpose of an estimate of the channel effect H shown in Equation 3 and, thus, this conjugate transpose is designated H^(H) and since the estimate is involved it is shown as Ĥ^(H). Note that the channel effect used for this computation is generally determined by receiver 54 by estimating the channel effect on pilot symbols it receives from transmitter 52. In the art, the operation of matched filter 60 is sometimes referred to as part of a different block such as a rake, rake filter, space time rake filter, signal separation block, or the like. In any event, the output of matched filter block 60 may be shown as the vector y in the following Equation 8:

y=Ĥ^(H) r  Equation 8

[0021] Next, Equation 7 may be substituted for r in Equation 8, and assuming the estimate of H is a fairly accurate estimate then the value H^(H) may be used for Ĥ^(H), yielding the following Equation 9:

y=H ^(H) Hx+H ^(H) W   Equation 9

[0022] In Equation 9, the result of H^(H) H is Hermitian symmetric and non-negative definite. Hence, from matrix theory, H^(H) H may be re-stated according to eigen decomposition as shown in the following Equation 10:

H^(H)H=UΛU^(H)  Equation 10

[0023] Eigen decomposition indicates that the factor U from Equation 10 is defined as shown in the following Equation 11:

U=[u ₁ u ₂]  Equation 11

[0024] In Equation 11, u₁ and u₂ are referred to as eigenvectors, that is, they are the eigenvectors of H^(H) H; sometimes in the wireless art, such vectors are instead referred to as eigenmodes due to the transmission in response to these values as described later. The eigenvectors are further defined according to the following Equations 12 and 13: $\begin{matrix} {{\underset{\_}{u}}_{1} = \begin{bmatrix} u_{11} \\ u_{12} \end{bmatrix}} & {{Equation}\quad 12} \\ {{\underset{\_}{u}}_{2} = \begin{bmatrix} u_{21} \\ u_{22} \end{bmatrix}} & {{Equation}\quad 13} \end{matrix}$

[0025] Additionally, the eigenvectors have the following properties of Equations 14 and 15:

u ₁ ^(H)u₁=u ₂ ^(H)u₂=1  Equation 14

u ₁ ^(H)u₂=u ₂ ^(H)u₁=0  Equation 15

[0026] From the above, the two eigenvectors u ₁ and u ₂ are orthogonal and perpendicular, and as shown below they also are non-interfering with one another, which allows transmission of signals in response to these eigenvectors so that those signals do not interfere with one another. Additionally, the matrix U may be re-written with the eigenvectors u₁ and u₂ in its columns, as shown in the following Equation 16: $\begin{matrix} {U = \begin{bmatrix} u_{11} & u_{12} \\ u_{21} & u_{22} \end{bmatrix}} & {{Equation}\quad 16} \end{matrix}$

[0027] Eigen decomposition also indicates that the factor Λ from Equation 10 is defined as shown in the following Equation 17: $\begin{matrix} {\Lambda = \begin{bmatrix} \lambda_{1} & 0 \\ 0 & \lambda_{2} \end{bmatrix}} & {{Equation}\quad 17} \end{matrix}$

[0028] In the diagonal matrix of Equation 17, and in connection with H^(H) H, λ₁ and λ₂ are referred to as its eigenvalues, and they are real numbers greater than or equal to zero. Additionally, each eigenvalue λ₁ and λ₂ is linked to a corresponding one of the eigenvectors u ₁ and u ₂, respectively, and are analogous to a gain factor for the corresponding eigenvector. This relationship can similarly be shown by re-writing Equation 10 as the following Equation 18: $\begin{matrix} {{H^{H}H} = {{U\quad \Lambda \quad U^{H}} = {\sum\limits_{i = 1}^{2}{\lambda_{i}{\underset{\_}{u}}_{i}{\underset{\_}{u}}_{i}^{H}}}}} & {{Equation}\quad 18} \end{matrix}$

[0029] From Equation 18, one skilled in the art will therefore appreciate the correspondence of the eigenvalue λ₁ with the eigenvector u ₁ and the correspondence of the eigenvalue λ₂ with the eigenvector u ₂.

[0030] Continuing now with receiver 54, the resulting vector y from matched filter 60 is output to a matrix multiplication block 62. Matrix multiplication block 62 multiplies its vector input times the conjugate transpose of the matrix U of Equation 16, that is, the multiplicand is therefore U^(H). The result of this operation, as further detailed below, provides a vector z that includes separate output symbols z₁ and z₂, and which correspond to the independently-transmitted signals x₁ and x₂, respectively (and, hence, also to symbols s₁ and s₂, respectively). Thus, the operation of matrix multiplication block 62 may be represented by the following Equation 19:

z=U^(H) y  Equation 19

[0031] From the above, it has been shown that transmitter 52 includes a matrix multiplication block 58 that multiplies parallel input symbols streams times the matrix U, and receiver 54 includes a matrix multiplication block 58 that multiplies its input signals times the conjugate transpose of that matrix, namely, U^(H). These aspects are now further explored so as to demonstrate how these operations provide for the transmission of independent symbol streams and the recovery of those streams at receiver 54 without interference between them.

[0032] Returning to transmitter 52, recall that symbols s₁ and s₂ are multiplied times {square root}{square root over (p₁)} and {square root}{square root over (p₂)}, respectively. This operation may be represented mathematically by defining the matrix, Π, in the following Equation 20: $\begin{matrix} {\Pi = \begin{bmatrix} \sqrt{p_{1}} & 0 \\ 0 & \sqrt{p_{2}} \end{bmatrix}} & {{Equation}\quad 20} \end{matrix}$

[0033] Further, let the vector s be defined to include the symbols s₁ and S₂, and let the vector x be defined to include the transmitter outputs x₁ and x₂, then the output of transmitter 52 is as shown in the following Equation 21:

x=UΠs  Equation 21

[0034] Returning to receiver 54, recall that blocks 60 and 62 perform multiplications times H^(H) and U^(H), respectively. The effect of these multiplications now may be appreciated further, particularly by substituting Equation 10 into Equation 9, to yield the vector shown in the following Equation 22:

y=UΛU ^(H) x+H ^(H) w   Equation 22

[0035] Next, Equation 22 may be substituted into Equation 19 for y to define the output vector, z, from multiplication block 62, as is shown in the following Equation 23:

z=U ^(H)(UΛU ^(H) x+H ^(H) w )=U ^(H) UΛU ^(H) x+U ^(H) H ^(H) w   Equation 23

[0036] Equation 23 can be reduced due to the property of the eigenvector matrix U as shown in the following Equation 24: $\begin{matrix} {{U^{H}U} = {I = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}}} & {{Equation}\quad 24} \end{matrix}$

[0037] From Equation 24, therefore, the identity matrix result, I, may be removed from Equation 23, and additionally Equation 21 may be substituted into Equation 23 for x, while also disregarding the noise term relating to the vector w, with the result shown in the following Equation 25:

z=ΛU^(H) x=ΛU^(H)UΠs=ΛΠs  Equation 25

[0038] Having developed Equation 25 as a result of the two matrix multiplications (i.e., U^(H), H^(H)) in receiver 54, it is now shown how the eigenmode transmissions do not interfere with one another. Specifically, Equation 25 may be fully written out and simplified according to the following Equation 26: $\begin{matrix} {\left\lbrack \quad \begin{matrix} z_{1} \\ z_{2} \end{matrix} \right\rbrack = {{{\left\lbrack \quad \begin{matrix} \lambda_{1} & 0 \\ 0 & \lambda_{2} \end{matrix} \right\rbrack\left\lbrack \quad \begin{matrix} \sqrt{p_{1}} & 0 \\ 0 & \sqrt{p_{2}} \end{matrix} \right\rbrack}\left\lbrack \quad \begin{matrix} d_{1} \\ d_{2} \end{matrix} \right\rbrack} = {{\left\lbrack \quad \begin{matrix} {\lambda_{1}\sqrt{p_{1}}} & 0 \\ 0 & {\lambda_{2}\sqrt{p_{2}}} \end{matrix}\quad \right\rbrack\left\lbrack \quad \begin{matrix} s_{1} \\ s_{2} \end{matrix} \right\rbrack} = \left\lbrack \quad \begin{matrix} {\lambda_{1}s_{1}\sqrt{p_{1}}} \\ {\lambda_{2}s_{2}\sqrt{p_{2}}} \end{matrix}\quad \right\rbrack}}} & {{Equation}\quad 26} \end{matrix}$

[0039] From Equation 26, it may be seen that as a result of the multiplication by blocks 60 and 62, z₁ is a value that is responsive to s₁ irrespective of S₂, and similarly, z₂ is a value that is responsive to s₂ irrespective of s₁. In other words, there is no interference as between s₁ and s₂, as transmitted to receiver 54. This result occurs due to the orthogonality property shown in Equation 24, as realized by the multiplication of the transmitted signals by U in block 52 and the later multiplication of the received signals by U^(H) in block 62. As a result, following block 62, and unlike certain other wireless systems, there is no additional interference cancellation block in receiver 54.

[0040] While eigenmode system 50 provides communication of independent symbol streams and does not require interference cancellation at the receiver, note that transmitter 52 necessarily requires sufficient channel state information to determine the matrix U. In an FDD system where the uplink and downlink channels are asymmetric, then receiver 54 must therefore provide this information to transmitter 52 in some form. For example, receiver 54 must either receive the eigenvectors and eigenvalues from receiver 54, or it must receive sufficient information from receiver 54 so that it may determine these values on its own from the received information. However, for FDD systems, the requirement of feeding back sufficient state information may itself not be feasible due to the high amount of bandwidth that would be required to feed back such information. For example, when four transmit antennas are used, then possibly four eigenvectors must be computed by receiver 54 and fed back, where each eigenvector is represented by four coefficients (including the power weighting eigenvalue for each stream), representing a total of 16 coefficients. Assuming that each coefficient is quantized to N_(Q) bits, this requires a 16×N_(Q) bit feedback resource. However, in the current WCDMA standard, only 1 feedback bit per slot is sent to the transmitter. Thus, to implement an eigenmode system even for N_(Q)=2, this would result in an intrinsic delay of 32 slots, which therefore is not acceptable even in slow fading channels. In addition, trade-offs may be realized by transmitting only via the best channel eigenvector which gives the maximum diversity gain at the expense of low data rate, or one may utilize all the channel eigenvectors to transmit different data streams and thus increase the data rate, while losing diversity gain and hence decreasing performance. In theory, to partially overcome this loss of diversity, a power allocation scheme across eigenvectors can be used to reduce the channel variation caused by the fading. However, for FDD systems where the requirement of feeding back state information may itself not be feasible due to the high amount of bandwidth it consumes, this additional amount of feedback makes the total amount of return information even less feasible. Moreover, if the feedback rate is fixed, such a proposal would increase the delay time before transmitter 52 acquires the eigenvectors. This then results in a large performance loss, particularly when the channel is time varying.

[0041] In view of the above, there arises a need to address the drawbacks of the prior art and the preceding proposals, as is achieved by the preferred embodiments described below.

BRIEF SUMMARY OF THE INVENTION

[0042] In the preferred embodiment, there is a wireless receiver for receiving signals from a transmitter. The transmitter comprises a plurality of transmit antennas for transmitting the signals, which comprise respective independent streams of symbols. Additionally, interference occurs between the respective streams. The receiver comprises a plurality of receive antennas for receiving the signals as influenced by a channel effect between the receiver and the transmitter. The receiver also comprises circuitry for multiplying the signals times a conjugate transpose of an estimate of the channel effect and times a conjugate transpose of a linear basis transformation matrix. The receiver also comprises circuitry for selecting the linear basis transformation matrix from a finite set of linear basis transformation matrices. Lastly, the receiver comprises circuitry for removing the interference between the respective streams. Other aspects are also disclosed and claimed.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING

[0043]FIG. 1 illustrates an electrical block diagram of a prior art CDMA system with a transmitter and a receiver.

[0044]FIG. 2 illustrates an electrical block diagram of a proposed eigenmode system with a transmitter and a receiver.

[0045]FIG. 3 illustrates an electrical and functional block diagram of a multi-input multi-output (“MIMO”) system according to one preferred embodiment and which includes a transmitter and a receiver.

[0046]FIG. 4 illustrates an electrical and functional block diagram of a double space time block coded transmit antenna diversity system according to another preferred embodiment and which includes a transmitter and a receiver.

DETAILED DESCRIPTION OF THE INVENTION

[0047]FIGS. 1 and 2 were described earlier in the Background Of The Invention section of this document and the reader is assumed to be familiar with the concepts described therein.

[0048] By way of introduction, the preferred embodiments provide a wireless communication system wherein multiple transmit antennas are used to communicate independent symbol streams and where, prior to transmission, those streams are transformed using a linear basis; preferably the linear basis is selected by the receiver from a finite set of different bases and an identification of the selected basis, along with any parameter(s) corresponding to that basis, are communicated (i.e., fed back) from the h receiver to the transmitter. Such an approach may be implemented in a variety of multi-antenna systems, and for sake of illustration two such systems are described along with variations on each. Finally, there is presented additional discussion from which one skilled in the art should appreciate the application of these principles to still other systems.

[0049]FIG. 3 illustrates an electrical and functional block diagram of a multi-input multi-output (“MIMO”) system 70 according to one preferred embodiment. As FIG. 3 represents an electrical and functional block diagram, one skilled in the art may ascertain various technical manners of implementing system 70 using a combination of hardware and software, including the preferred used of a digital signal processor to include at least some of the illustrated blocks. Turning then to system 70, it includes a transmitter 72 and a receiver 74. Transmitter 72 and receiver 74 in some respects are comparable to system 10 described earlier; thus, to simplify the present discussion the comparable blocks are shown with a like reference identifier, with the addition of an apostrophe to the identifier in FIG. 3 so that certain blocks may be referred to with respect to system 70 without causing a confusing reference as to the earlier prior art system 10. Additionally, the comparable blocks are discussed to a lesser extent below given the previous discussion as well as the skill in the art. Finally, as a multiple antenna system, in the illustrated example two transmit and two receive antennas are illustrated. However, the present inventive teachings may be extended to various systems with P transmit antennas and Q receive antennas.

[0050] Looking to transmitter 72, functional blocks 16′ through 24′ are now described with it understood that generally these blocks may perform functions known in the art, with the overall function of transmitter 72, including these blocks, being improved based on additional functional blocks described below. Transmitter 72 receives information bits B_(i) at an input to a channel encoder 16′, which encodes the information bits B_(i) in an effort to improve raw bit error rate. Various encoding techniques may be used by channel encoder 16 and as applied to bits B_(i), with examples including the use of convolutional code, block code, turbo code, concatenated codes, or a combination of any of these codes. The encoded output of channel encoder 16′ is coupled to the input of an interleaver 18′. Interleaver 18′ operates with respect to a block of encoded bits and shuffles the ordering of those bits so that the combination of this operation with the encoding by channel encoder 16′ exploits the time diversity of the information. For example, one shuffling technique that may be performed by interleaver 18′ is to receive bits in a matrix fashion such that bits are received into a matrix in a row-by-row fashion, and then those bits are output from the matrix to a modulator 20′ in a column-by-column fashion. Modulator 20′ is in effect a symbol mapper in that it converts its input bits to symbols, designated generally as s_(i). The converted symbols s_(i) may take various forms, such as quadrature phase shift keying (“QPSK”) symbols, binary phase shift keying (“BPSK”) symbols, or quadrature amplitude modulation (“QAM”) symbols. In any event, symbols s_(i) may represent various information such as user data symbols, pilot symbols, and control symbols such as transmit power control (“TPC”) symbols and rate information (“RI”) symbols. Symbols s_(i) are coupled to a serial-to-parallel converter 22′. Serial-to-parallel converter 22′ receives incoming symbols and outputs them in parallel along its outputs 22o₁′ and 22o₂′. For the sake of example, therefore, FIG. 3 illustrates that a stream of symbols, s₁ followed by s₂, is input to serial-to-parallel converter 22′ and serial-to-parallel converter 22′ therefore outputs symbol s₁ along output 22o₁′ and symbol s₂ along output 22o₂′.

[0051] The independent parallel symbol streams from serial-to-parallel converter 22′ are connected as inputs to a matrix multiplication block 76. Matrix multiplication block 76 performs a linear basis transformation on its inputs by multiplying the signals from outputs 22o₁ and 22o₂ times a linear basis transformation matrix V^((n)), where V^((n)) is detailed later. By way of introduction, V^((n)) is selected by receiver 74 from a finite set of different matrices and receiver 74 identifies that selection to transmitter 72 via the wireless feedback control channel between receiver 74 and transmitter 72, where a dashed line represents this wireless feedback link from receiver 74 to transmitter 72. Further in this regard, transmitter 72 includes a feedback decode block 78 and along the feedback path receiver 74 provides sufficient information to feedback decode block 78 to indicate the selection of V^((n)). As detailed below, there may be one or more parameters associated with V^((n)), and these parameters are also communicated along the feedback path to feedback decode block 78. In response, feedback decode block 78 determines the appropriate values for V^((n)) and provides them to matrix multiplication block 76 so that it may multiply V^((n)) times the incoming independent parallel symbol streams from outputs 22o₁′ and 22o₂′ of serial-to-parallel converter 22′. Lastly, as detailed below, in the preferred embodiment the selection of V^((n)) is in response to the channel effect, H, between transmitter 72 and receiver 74 and it also may be selected in response to the type of joint interference cancellation technique implemented by receiver 74.

[0052] The outputs 76o₁ and 76o₂ of matrix multiplication block 76 are in a CDMA embodiment connected to a spreader 24′, or alternatively in a TDMA embodiment those outputs are connected directly to respective transmit antennas TAT₁′ and TAT₂′ (via a digital-to-analog interface, not shown). Due to these alternatives, spreader 24′ is shown within a dashed line block. Looking first to the CDMA implementation, spreader 24′ modulates each data symbol by combining it with, or multiplying it times, a CDMA spreading sequence which can be a pseudo-noise (“PN”) digital signal or PN code or other spreading codes (i.e., it utilizes spread spectrum technology), where the approach therefore may be a single or multicode approach. In a single code instance, the signals from each of the different outputs 76o₁ and 76o₂ is multiplied times the same code. In a multicode instance, each stream output 76o₁ and 76o₂ is further divided into ds streams. Each of those ds streams is multiplied times a different and orthogonal code in a given set of ds codes, and where the same set of ds codes is used for each of the different outputs 76o₁ and 76o₂.Further, for each set of ds streams corresponding to outputs 76o₁ and 76o₂., the resulting products following the code multiplication are summed and the sum is output to a respective one of antennas TAT₁′ and TAT₂′. Further, the outputs of spreader 24′ are connected to respective transmit antennas TAT₁′ and TAT₂′ via a digital-to-analog interface, not shown. From the above, therefore, note that spreader 24′ is optional in that it is implemented when transmitter 72 is to function as a CDMA transmitter and it is not implemented when transmitter 72 is to function as a TDMA transmitter. In either event, the ultimate signals are connected, with or without spreading, to respective transmit antennas TAT₁′ and TAT₂′, and for the sake of later reference, let the signals communicated by transmit antennas TAT₁′ and TAT₂′ be designated as x₁ and x₂, respectively.

[0053] Turning to receiver 74, it includes receive antennas RAT₁′ and RAT₂′, where those antennas in a CDMA embodiment are connected to a despreader 32′ and in a TDMA embodiment they are connected directly to a matched filter 80 (with either connection being through an analog-to-digital interface, not shown). Again due to the alternatives including an option to exclude despreader 32′, then it is shown within a dashed line block. Further, these options correspond to those stated above with respect to transmitter 72 in connection with its spreader 24′, that is, when system 70 is implemented as a CDMA system, then spreader 24′ and despreader 32′ are included, whereas when system 70 is implemented as a TDMA system, then spreader 24′ and despreader 32′ are not included. Still further, despreader 32′ should accommodate the number of codes used by spreader 24′, where recall above there is discussed both a single code and multicode alternative, where one skilled in the art may readily implement the corresponding despreading apparatus in despreader 32′ based on which of these alternatives is implemented. In any event, let the signals received by receive antennas RAT₁′ and RAT₂′ be indicated as r₁ and r₂, with or without subsequent despreading.

[0054] The signals r₁ and r₂ are connected to a matched filter 80. In the preferred embodiment, matched filter 80 multiplies the incoming signals times a matrix that represents a conjugate transpose of an estimate of the channel effect H, that is, it multiplies times Ĥ^(H), where the value Ĥ designates the estimate of H; in addition, however, it also multiplies times the conjugate transpose of V^((n)), where recall that V^((n)) is imparted into the communicated signals by matrix multiplication block 76 of transmitter 72. Thus, by combining both multiplicand matrices, it may be stated that matched filter 80 produces outputs y₁ and y₂ in a vector y, where this operation is represented by the following Equation 27:

y=V ^((n)) ^(H) Ĥ ^(H) r=(ĤV ^((n)))^(H) r   Equation27

[0055] Further in connection with receiver 74 and Equation 27, receiver 74 also includes blocks that determine and provide the values of Ĥ and V^((n)). These blocks are further described below.

[0056] Receiver 74 includes a channel estimator 82 that receives the pilot symbols from receive antennas RAT₁′ and RAT₂′, where these pilot symbols are typically communicated in a separate channel such as the known common pilot channel (“CPICH”). In such a case, the pilot symbols are spread by transmitter 72 with a code that differs from the code used to spread the data channel. Alternatively, pilot symbols could be included in the same channel as the data symbols in which case both the pilot and data symbols are spread with the same code. In either approach, therefore, the spreading of the pilot symbols requires a despreading operation at receiver 74 and, thus, the pilot symbols are shown for illustration purposes as provided from the output of despreader 32′. In response to the pilot symbols, channel estimator 82 determines an estimated value of H (designated as Ĥ). Specifically, the values of r₁ and r₂ at a time t, including the pilot symbols in those signals, should be represented by the following Equation 28: $\begin{matrix} \left\lbrack {\begin{matrix} r_{1} & \left. r_{2}\quad \right\rbrack \end{matrix} = \left\lbrack \quad {{{\begin{matrix} h_{1} & \left. h_{2}\quad \right\rbrack \end{matrix}{{V^{(n)}\left( {t - 1} \right)}\begin{bmatrix} s_{1} \\ s_{2} \end{bmatrix}}} + {noise}} = {{{{HV}^{(n)}\left( {t - 1} \right)}s} + {noise}}} \right.} \right. & {{Equation}\quad 28} \end{matrix}$

[0057] However, given Equation 28, note that in the preferred embodiment the pilot symbols are in the separate CPICH channel and that channel is not multiplied times V^((n)) by transmitter 72. Accordingly, for the sake of the pilot symbols representing s and included in r₁ and r₂, then the term V^((n))(t−1) drops out of Equation 28; as a result, channel estimator 82 estimates H by solving for it from the received values of r₁, r₂, and the known pilot symbol values s, where H is therefore the determined channel effect estimate. Note that the preceding assumes that the pilot symbols are not transformed using the basis matrix, V^((n))(t−1) by transmitter 72; in an alternative embodiment, the pilot symbols along with the data symbols can be communicated by transforming them in response to the basis matrix, such as where the pilot and data symbols are communicated along the same channel. In this alternative, then V^((n)) remains in Equation 28 insofar as the pilot and data symbols are concerned, and the total product HV^((n)) may be determined by channel estimator 82 given the known values of r₁, r₂, and s. Once H is determined by channel estimator 82, it is output to a V^((n)) basis selector block 84 and to a compute combined effective channel block 86, each of which is discussed below.

[0058] As further detailed later, V^((n)) basis selector block 84 periodically chooses V^((n)) from a finite set of bases {V⁽¹⁾, V⁽²⁾, . . . , V^((N))}. V^((n)) basis selector block 84 then communicates an identification of the selected V^((n)) from receiver 74 back to transmitter 72 along the feedback path shown by way of a dashed line between the two. Further, the selection of V^((n)) is repeated over time so that V^((n)) therefore changes over time, that is, at a time t=1, then a basis V^((n))(1) is communicated in this manner, and a time t=2, then a basis V^((n))(2) is communicated in this manner, and so forth for V^((n))(t) at a different time t. In other words, system 70 is adaptive in the sense that it periodically re-evaluates the set of differing bases in the set of bases and may from time to time it uses different ones of those bases to transform communications so as to improve communication performance. Given these time-varying values, then V^((n)) basis selector block 84 also communicates an identification of V^((n)) to a compute combined effective channel block 86, as detailed below.

[0059] Compute combined effective channel block 86 determines the product of the matrices it receives from blocks 82 and 84 (unless that product was already determined by due to the inclusion of the pilot and data in the same channel as discussed above with respect to channel estimator 82). To perform this operation, recall that V^((n)) basis selector block 84 communicates to block 86 each value of V^((n)) and, therefore, this includes the immediately previous value of V^((n)) that it fed back to transmitter 72 (i.e., V^((n))(t−1)). In response, block 86 determines the product of Ĥ and V^((n))(t−1), where the designation of this product is simplified in the remaining discussion by dropping the temporal aspect of (t−1) and hence, is referred to as (ĤV^((n))). Further, this product, or its conjugate transpose, (ĤV^((n)))^(H), is output by block 86 to matched filter 80, which uses this product to solve for the vector y in Equation 27 described above.

[0060] The outputs 80 ₁ and 80 ₂ of matched filter 80 provide y₁ and y₂ of the vector y to a joint interference cancellation and detector block 88, and block 88 also receives the value of (ĤV^((n)))^(H) from compute combined effective channel block 86. In general, each input y_(x) to matched filter 80 is corrupted with interference from the other streams. Accordingly, block 88 performs as its name suggests, that is, it removes the interference that exists in y₁ and y₂, as it arose from the originally-independent transmitted symbols s₁ and s₂, thereby producing two respective separated estimated symbols ŝ₁ and ŝ₂. Further in this regard, block 88 performs its function according to any one of various algorithms known in the art. At least the following approaches are contemplated for block 88 and include: (i) zero forcing or minimum mean square error (“MMSE”); (ii) 1-shot (i.e., linear) or iterative; (iii) 1-stage or multistage; and (iv) maximum likelihood detection. Certain of these techniques also may be combined, as is known, such as with a linear MMSE, an iterative MMSE, a linear zero forcing, and an iterative zero forcing. Moreover, one skilled in the art may contemplate other examples as well. Lastly, note that the operation of block 88 is a linear function, as is the operation of matched filter 80. Accordingly, the order of these two operations may be reversed and, thus, the ordering as shown in FIG. 3 is only by way of example.

[0061] The estimated symbols ŝ₁ and ŝ₂ are output by joint interference cancellation and detector block 88 to the remaining circuitry in receiver 74, which may be constructed and operate according to known principles. Thus, these outputs are preferably connected to a parallel-to-serial converter 34′, which converts the two parallel streams into a single total estimated symbol stream, Ŝ_(T). The estimated symbol stream is connected to a demodulator 36′, which removes the modulation imposed on the signal my modulator 20′ of transmitter 72. The output of demodulator 36′ is connected to a deinterleaver 38′, which performs an inverse of the function of interleaver 18′ of transmitter 72, and the output of deinterleaver 38′ is connected to a channel decoder 40′. Channel decoder 40′ may include a Viterbi decoder, a turbo decoder, a block decoder (e.g., Reed-Solomon decoding), or still other appropriate decoding schemes as known in the art. In any event, channel decoder 40′ further decodes the data received at its input, typically operating with respect to certain error correcting codes, and it outputs a resulting stream of decoded symbols. Indeed, note that the probability of error for data input to channel decoder 40′ is far greater than that after processing and output by channel decoder 40′. Finally, the decoded symbol stream output by channel decoder 40′ may be received and processed by additional circuitry in receiver 74, although such circuitry is not shown in FIG. 3 so as to simplify the present illustration and discussion.

[0062] Returning now to discuss V^((n)) basis selector block 84 in greater detail, recall that it periodically chooses V^((n)) from a finite set of bases {V⁽¹⁾, V⁽²⁾, . . . , V^((N))}, where this set also can be represented by the designation {V^((n))}_(n=1) ^(N). Attention is now directed to certain preferred sets of those bases. When the preferred embodiment is implemented in a MIMO-type system such as is shown for system 70, then two different basis sets are preferred, with one that rotates the received signals in two-dimensional space and another that includes the rotation and adds a potential phase change as another dimension, where both basis sets are described below. In either case and for a MIMO-type implementation, and for P=2, then the linear basis transformation matrix V^((n)), as used by matrix multiplication block 76, is a 2×2 matrix. Accordingly, V^((n)) basis selector 84 of receiver 74 evaluates a set of 2×2 matrices, and it identifies back to transmitter 72 the one that optimizes performance as also detailed later.

[0063] In one preferred embodiment, the finite set of bases {V^((n))}_(n=) ₁ ^(N) is as shown in the following Equations 29 and 30: $\begin{matrix} {V^{(n)} = \begin{bmatrix} {\cos \quad \theta_{n}} & {{- \sin}\quad \theta_{n}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{bmatrix}} & {{Equation}\quad 29} \\ {{\theta_{n} = {\frac{\pi}{2N}\left( {n - 1} \right)}},{n = 1},2,\ldots,N} & {{Equation}\quad 30} \end{matrix}$

[0064] To further illustrate Equation 29 and 30, consider an example wherein N=4, that is, where there are four possible linear basis transformation matrices from which receiver 74 may select an optimum one of those matrices. As applied to Equations 29 and 30, therefore, the four matrices in the set {V^((n)}) _(n=1) ^(N) have the differing degrees of signal rotation shown in the following Equations 31 through 34: $\begin{matrix} {V^{(1)} = {\begin{bmatrix} {\cos \left\{ {\frac{\pi}{8}(0)} \right\}} & {{- \sin}\left\{ {\frac{\pi}{8}(0)} \right\}} \\ {\sin \left\{ {\frac{\pi}{8}(0)} \right\}} & {\cos \left\{ {\frac{\pi}{8}(0)} \right\}} \end{bmatrix} = {\begin{bmatrix} {\cos (0)} & {- {\sin (0)}} \\ {\sin (0)} & {\cos (0)} \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}}}} & {{Equation}\quad 31} \\ {V^{(2)} = {\left\lbrack \quad \begin{matrix} {\cos \left\{ {\frac{\pi}{8}(1)} \right\}} & {{- \sin}\left\{ {\frac{\pi}{8}(1)} \right\}} \\ {\sin \left\{ {\frac{\pi}{8}(1)} \right\}} & {\cos \left\{ {\frac{\pi}{8}(1)} \right\}} \end{matrix} \right\rbrack = {\left\lbrack \quad \begin{matrix} {\cos \left( \frac{\pi}{8} \right)} & {- {\sin \left( \frac{\pi}{8} \right)}} \\ {\sin \left( \frac{\pi}{8} \right)} & {\cos \left( \frac{\pi}{8} \right)} \end{matrix} \right\rbrack = \left\lbrack \quad \begin{matrix} {.9239} & {- {.3827}} \\ {.3827} & {.9239} \end{matrix}\quad \right\rbrack}}} & {{Equation}\quad 32} \\ {V^{(3)} = {\left\lbrack \quad \begin{matrix} {\cos \left\{ {\frac{\pi}{8}(2)} \right\}} & {{- \sin}\left\{ {\frac{\pi}{8}(2)} \right\}} \\ {\sin \left\{ {\frac{\pi}{8}(2)} \right\}} & {\cos \left\{ {\frac{\pi}{8}(2)} \right\}} \end{matrix} \right\rbrack = {\left\lbrack \quad \begin{matrix} {\cos \left( \frac{\pi}{4} \right)} & {- {\sin \left( \frac{\pi}{4} \right)}} \\ {\sin \left( \frac{\pi}{4} \right)} & {\cos \left( \frac{\pi}{4} \right)} \end{matrix} \right\rbrack = \left\lbrack \quad \begin{matrix} {.7071} & {- {.7071}} \\ {.7071} & {.7071} \end{matrix}\quad \right\rbrack}}} & {{Equation}\quad 33} \\ {V^{(3)} = {\left\lbrack \quad \begin{matrix} {\cos \left\{ {\frac{\pi}{8}(3)} \right\}} & {{- \sin}\left\{ {\frac{\pi}{8}(3)} \right\}} \\ {\sin \left\{ {\frac{\pi}{8}(3)} \right\}} & {\cos \left\{ {\frac{\pi}{8}(3)} \right\}} \end{matrix} \right\rbrack = {\left\lbrack \quad \begin{matrix} {\cos \left( {{.375}\pi} \right)} & {- {\sin \left( {{.375}\pi} \right)}} \\ {\sin \left( {{.375}\pi} \right)} & {\cos \left( {{.375}\pi} \right)} \end{matrix} \right\rbrack = \left\lbrack \quad \begin{matrix} {.3827} & {- {.9239}} \\ {.9239} & {.3827} \end{matrix}\quad \right\rbrack}}} & {{Equation}\quad 34} \end{matrix}$

[0065] From the preceding, it may be appreciated that by implementing V^((n)) of Equation 29, then receiver 74 is only required to feed back the selected matrix to transmitter 72 by communicating the value of n. Given n, and assuming feedback decode block 78 of transmitter 72 is informed (e.g., programmed with) of N and Equations 29 and 30, then in response to n, feedback decode block 78 outputs the appropriate matrix V^((n)) to matrix multiplication block 76, and matrix multiplication block 76 essentially performs a signal rotation of θ_(n) degrees in two-dimensional space by multiplying V^((n)) times its input symbols. Lastly, note that since n=1, 2, . . . , N, then in the example where N=4, then receiver 74 requires only 2 bits (i.e., log₂(4)=2) to feed back this information to transmitter 72.

[0066] In another preferred embodiment, the finite set of bases {V^((n))}_(n=1) ^(N) is as shown in the following Equations 35 through 37: $\begin{matrix} {V^{(n)} = \begin{bmatrix} {\cos \quad \theta_{n}^{{j\varphi}_{m}}} & {{- \sin}\quad \theta_{n}^{{j\varphi}_{m}}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{bmatrix}} & {{Equation}\quad 35} \\ {{\theta_{n} = {\frac{\pi}{2N}\left( {n - 1} \right)}},{n = 1},2,\ldots,N} & {{Equation}\quad 36} \\ {{\varphi_{m} = {\frac{\pi}{2M}\left( {m - 1} \right)}},{m = 1},2,\ldots,M} & {{Equation}\quad 37} \end{matrix}$

[0067] For the sake of simplifying the discussion, the various combinations of Equations 35 through 37 achieved by the different values of n and m are not set forth herein, but they should be appreciated by one skilled in the art. In addition, by comparing Equation 35 to Equation 29, one skilled in the art should appreciate that by implementing V^((n)) of Equation 35, then receiver 74 feeds back an identification of the selected matrix to transmitter 72 by communicating the value of n so as to achieve a rotation of θ_(n) degrees in two-dimensional space, and in addition receiver 74 feeds back the selected amount of phase change by communicating the value of m. Thus, the rotation and phase change may be accomplished by receiver feeding back only a total of log₂(N)+log₂(M) bits to transmitter 72.

[0068] From the above, two different sets of linear basis transformation matrices V^((n)) have been demonstrated in accordance with the preferred embodiment. Observe that both basis parametrizations in Equations 29 and 35 result in orthonormal matrices. However, one skilled in the art may ascertain other choices of parametrization which do not result in orthonormal matrices while still falling within the present inventive scope. Additionally, the preceding linear basis transformation matrices are merely examples of preferred matrices, and others are contemplated. For example, for P>2, a generalized rotation matrix, such as a Givens rotation scheme, can be used. Still others are also ascertainable by one skilled in the art.

[0069] Having illustrated various different possible finite sets of {V^((n))}_(n=1) ^(N), recall that given one of those sets, V^((n)) basis selector block 84 identifies one matrix V^((n)) as the optimum performer and receiver 74 identifies that matrix to transmitter 72. Attention is now turned to the criterion or criteria used by V^((n)) basis selector block 84 to, at a given time, make this selection of one basis from among a set of bases. In general, each basis V^((n)) is selected to optimize a performance criterion or criteria. The ultimate goal is to minimize bit error rate (“BER”). In this regard, the preferred embodiments recognize that BER is influenced by the channel effect H, and the channel effect H affects signal-to-interference-noise ratio (“SINR”). In other words, SINR is a function of H and, accordingly, in the preferred embodiment V^((n)) basis selector block 84 endeavors to periodically select V^((n)) in response to the then-existing SINR, that is, the criterion for selecting V^((n)) is based on optimizing SINR. To accomplish this operation, note that channel estimator 82 not only provides the estimated channel effect Ĥ to block 86, but it also provides it to basis selector 84 so that basis selector 84 may determine the SINR from Ĥ and select a basis V^((n)) accordingly. In addition to considering the estimated channel effect Ĥ (and the corresponding SINR), in the preferred embodiment the selection of V^((n)) also may be based on the type of technique implemented by joint interference cancellation and detector block 88. Specifically, recall from above that numerous alternatives are contemplated for block 88; accordingly, for a given value of Ĥ, then the specific technique implemented by block 88 also therefore may influence the selection of V^((n)); in other words, an additional criterion of basis selector 84 in making its selection may be the technique implemented by block 88. These criteria are further explored below.

[0070] In one preferred approach, V^((n)) basis selector block 84 determines the optimum SINR by applying each of the bases in the finite set {V^((n))}_(n=1) ^(N) to each of the P (e.g., two in FIG. 3) data streams to thereby produce SINR values for each, and then the criterion for selecting the basis by block 84 is choosing the basis that provides the maximum of the minimum SINR values. For example, assume that N=4 in the finite set {V^((n))}_(n=1) ^(N) and assume that P=2 as in FIG. 3. Then block 84 first determines the SINR for each different basis in the set, as applied to each independently-transmitted stream, and as measurable using various known techniques in view of Ĥ, as shown in the following Table 1: TABLE 1 V⁽¹⁾ V⁽²⁾ V⁽³⁾ V⁽⁴⁾ S₁ SINR₁ ⁽¹⁾ SINR₁ ⁽²⁾ SINR₁ ⁽³⁾ SINR₁ ⁽⁴⁾ S₂ SINR₂ ⁽¹⁾ SINR₂ ⁽²⁾ SINR₂ ⁽³⁾ SINR₂ ⁽⁴⁾

[0071] Table 1 therefore illustrates the total of P×N SINR possibilities, as resulting from an SINR determination for each of the N bases as applied to each of the P symbol streams. Given Table 1, next block 84 determines, for each value of V^((n)), which of the two SINR values, corresponding to the two transmitted symbol streams, is the lower value (i.e., it takes the minimum of each value). For example, assume that the following Table 2 illustrates each such minima from Table 1: TABLE 2 V⁽¹⁾ V⁽²⁾ V⁽³⁾ V⁽⁴⁾ minimum SINR₁ ⁽¹⁾ SINR₁ ⁽²⁾ SINR₂ ⁽³⁾ SINR₂ ⁽⁴⁾

[0072] In the example of Table 2, therefore, the SINR corresponding to stream s₁ is lower for V⁽¹⁾ and V⁽²⁾, while the SINR corresponding to stream s₂ is lower for V⁽³⁾ and V⁽⁴⁾. Finally, having made the minima determinations in Table 2, block 84 selects as optimum the value of V^((n)) that corresponds to the maximum of those minima. For example, assume that SINR₁ ⁽²⁾ is the largest value in Table 2; in response, block 84 identifies the respective basis V⁽²⁾ as the optimum basis for use by transmitter 72. Consequently, block 84 causes receiver 74 to feed back an indication of V⁽²⁾ to feedback decode block 78 of transmitter 72; in response, feedback decode block 78 provides V⁽²⁾ to matrix multiplication block 76, which in response multiplies V⁽²⁾ times future symbols to be transmitted, as described generally above with respect to transmitter 72. Thereafter, block 84 preferably repeats this process at later times, and at each such time an updated V^((n)) is therefore identified by receiver 74 and that identification is fed back to transmitter 72, thereby providing an adaptive process of selecting the optimum basis from the finite set of possible bases.

[0073] Having demonstrated one preferred methodology for optimizing SINR, note that various others may be ascertained and are included within the present inventive scope. For example, another approach is to choose the value of V^((n)) that minimizes the minimum mean square error. As another example, recall it is mentioned above that receiver 74 may be one of various types. For each of these different types of receivers, a closed form expression for its SINR is known in the art. Various different examples of such expressions are shown below.

[0074] As one example of an SINR expression arising from a type of receiver, for a linear zero forcing receiver in a case corresponding to two transmit antennas and Q receive antennas, its closed form SINR expression is defined for each of the two transmitted streams, thereby providing values SINR₁ and SINR₂, as shown in the following Equations 38 and 39: $\begin{matrix} {{SINR}_{1} = {\rho \quad {h_{1}^{H}\left( {I_{Q} - \frac{h_{2}h_{2}^{H}}{{h_{2}}^{2}}} \right)}h_{1}}} & {{Equation}\quad 38} \\ {{SINR}_{2} = {\rho \quad {h_{2}^{H}\left( {I_{Q} - \frac{h_{1}h_{1}^{H}}{{h_{1}}^{2}}} \right)}h_{2}}} & {{Equation}\quad 39} \end{matrix}$

[0075] In Equations 38 and 39, I_(Q) is the identity matrix of dimension Q×Q, and ρ is the normalized transmitted signal power defined according to the following Equation 40: $\begin{matrix} {\rho = \frac{ɛ_{s}}{\sigma^{2}}} & {{Equation}\quad 40} \end{matrix}$

[0076] where σ² is the square of the noise variance, E|s₁|²=E|s₂|²=ε_(s).

[0077] As another example of an SINR expression arising from a type of receiver, for a linear MMSE receiver in a case corresponding to two transmit antennas and Q receive antennas, its closed form SINR expression is defined for each of the two transmitted streams, thereby providing values SINR₁ and SINR₂, as shown in the following Equations 41 and 42: $\begin{matrix} {{SINR}_{1} = {\rho \quad {h_{1}^{H}\left( {I_{Q} - \frac{h_{2}h_{2}^{H}}{{h_{2}}^{2} + \rho^{- 1}}} \right)}h_{1}}} & {{Equation}\quad 41} \\ {{SINR}_{2} = {\rho \quad {h_{2}^{H}\left( {I_{Q} - \frac{h_{1}h_{1}^{H}}{{h_{1}}^{2} + \rho^{- 1}}} \right)}h_{2}}} & {{Equation}\quad 42} \end{matrix}$

[0078] As still another example of an SINR expression arising from a type of receiver, for an iterative zero forcing receiver in a case corresponding to two transmit antennas and Q receive antennas, its closed form SINR expression is defined for each of the two transmitted streams, thereby providing values SINR₁ and SINR₂, where SINR₁ is the same as for the linear zero forcing receiver shown above in Equation 38 and SINR₂ is shown in the following Equation 43:

SINR₂ =ρ∥h _(2∥) ²  Equation 43

[0079] These values of SINR₁ and SINR₂ assume that the first iteration is with respect to the first stream s₁. In contrast, if that first iteration were with respect to the second stream s₂, then SINR₂ would be the same as for the linear zero forcing receiver shown above in Equation 39 while SINR₁ would be as set forth in the following Equation 44:

SINR₁ =ρ∥h ₁∥²  Equation 44

[0080] As a final example of an SINR expression arising from a type of receiver, for an iterative MMSE receiver in a case corresponding to two transmit antennas and Q receive antennas, its closed form SINR expression is defined for each of the two transmitted streams, thereby providing values SINR₁ and SINR₂, where SINR₁ is the same as for the linear MMSE receiver shown above in Equation 41, while SINR₂ is shown in the previous Equation 43. These values of SINR₁ and SINR₂ assume that the first iteration is with respect to the first stream s₁. In contrast, if that first iteration were with respect to the second stream S₂, then SINR₂ would be the same as for the linear MMSE receiver shown above in Equation 42 while SINR₁ would be as set forth in the previous Equation 44.

[0081] In view of the expressions of the various Equations 38 through 44, or given a comparable SINR expression for a different type of receiver, any chosen manner of optimizing the SINR may be used to select the linear basis transformation matrix V^((n)) from the set {V^((n))}_(n=1) ^(N) and that corresponds to the optimized SINR. Additionally, note that signal-to-noise ratio (“SNR”) is a special case of SINR; specifically, for some receivers, such as for receivers incorporating zero forcing detector methods, they are considered to completely eliminate interference and, hence, their performance is specified in terms of SNR, that is, by removing the interference component from SINR to yield SNR. For such a receiver, the present inventive teachings also may be applied, wherein the linear basis transformation matrix V^((n)) is selected that corresponds to the optimized SNR rather than SINR. Thereafter, the selected matrix is identified by receiver 74 to transmitter 72, as described above.

[0082]FIG. 4 illustrates an electrical block diagram of a double space time block coded transmit antenna diversity (“DSTTD”) system 100 according to another preferred embodiment. Like FIG. 3, since FIG. 4 represents an electrical and functional block diagram, one skilled in the art may ascertain various technical manners of implementing system 100 into a combination of hardware and software, including the preferred used of a digital signal processor to include at least some of the illustrated blocks. Turning then to system 100, and by way of introduction, STTD technology in general is known in the art. Indeed, for further aspects that could be incorporated in such a system, the reader is invited to review the following two patent applications, both of which are hereby incorporated herein by reference: (i) U.S. patent application Ser. No. 09/578,004 (docket TI-29286), filed May 24, 2000; and (ii) U.S. patent application Ser. No. 09/885,878 (docket TI-31293), filed Jun. 20, 2001. In system 100, it includes a transmitter 102 and a receiver 104. In some respects, transmitter 102 and receiver 104 are comparable to transmitter 72 and receiver 74 of system 70 described earlier and, thus, to simplify the present discussion the comparable blocks are shown with a like reference identifier and are generally not discussed once more so as to simplify the remaining discussion. DSTTD system 100 is also a multiple antenna system with P transmit antennas and Q receive antennas, where in such a system Q can be larger than P; in the example of FIG. 4, therefore, P=4 so that transmit antennas TAT₁″ through TAT₄″ are shown, and Q is a larger number so that receive antennas RAT₁″ through RAT_(Q) are shown.

[0083] Looking to transmitter 102, blocks 16′ through 22′ are described earlier, and block 24″ is similar to block 24′ described earlier and is further addressed later. Coupled between block 22′ and block 24″ are two STTD encoders 105 ₁ an 105 ₂ and, hence, the reference to system 100 as a “double” STTD system. Each STTD encoder 105 ₁ and 105 ₂ has a corresponding input 105i₁, and 105i₂, along which it receives a block of two symbols. For the sake of example and convention, STTD encoder 105 ₁ receives symbols s_(1,1) and s_(1,2), while STTD encoder 105 ₂ receives symbols s_(2,1) and s_(2,2). Each STTD encoder 105 ₁ an 105 ₂ provides two outputs, where a first output provides the same input symbols as received at the encoder input while a second output provides, by way of example, the complex conjugates of the input symbols, wherein those conjugates are output in a reversed order relative to how they were input and the second symbol is a negative value relative to its value as an input. For example, with respect to encoder 105 ₁, its first output provides s_(1,1) and s_(1,2,) while its second output provides s_(1,2)* and −s_(1,1)*, where the superscript asterisk is intended to indicate the conjugate of the symbol. Similarly, with respect to encoder 105 ₂, its first output provides s_(2,1) and s_(2,2,) while its second output provides s_(2,2)* and −s_(2,1)*.

[0084] The outputs of STTD encoders 105 ₁ and 105 ₂ are connected to a matrix multiplication block 107. Matrix multiplication block 107 multiplies those outputs times a linear basis transformation matrix V^((n)), where V^((n)) is in general developed in the manner described above with respect to system 70, with two exceptions. First, in system 100, V^((n)) is a 4×4 matrix because P=4. Second, because system 100 is an STTD-type system rather than a MIMO-type system, then the set {V^((n))}_(n=1) ^(N) may include matrices differing from those preferred for a MIMO system. These differences are further explored later. Also as detailed below, while V^((n)) is a 4×4 matrix in connection with system 100 which therefore includes 16 values, in the preferred embodiment the sets of {V^((n))}_(n=1) ^(N) include matrices including values of zero and non-zero, where at most four unique non-zero values are included in each matrix V^((n))(although some of the non-zero values may be used more than once in the same matrix) Thus, these four values may be represented in the 2×2 simplified matrix VS shown in the following Equation 45: $\begin{matrix} {{V\quad S} = \begin{bmatrix} {vs}_{1,1} & {vs}_{2,1} \\ {vs}_{1,2} & {vs}_{2,2} \end{bmatrix}} & {{Equation}\quad 45} \end{matrix}$

[0085] Completing the connections within system 100, the outputs of matrix multiplication block 107 are connected to a spreader 24′″. Spreader 24′″ is shown with dashed lines for the same reason that such lines were used above with respect to spreader 24″ of system 70, namely, because such a function is preferred only if system 100 incorporates CDMA communications, whereas if it incorporates TDMA communications then spreader 24′″ is eliminated. The outputs of spreader 24′″ in a CDMA embodiment, or of matrix multiplication block 107 in a TDMA embodiment, are connected to transmit antennas TAT₁″ through TAT₄″ (via an analog-to-digital interface, not shown).

[0086] Turning to receiver 104, it includes receive antennas RAT₁″ through RAT_(Q) (connected to an analog-to-digital interface, not shown), where in a CDMA embodiment these antennas are connected to a despreader 32″, and in a TDMA embodiment despreader 32″ is eliminated. Either the de-spread signal in the CDMA embodiment or the antenna signal in the TDMA embodiment provides a signal block R. In the CDMA embodiment, block R can be written as in the following Equation 46:

R=(vs _(1,1) [h ₁ h ₂ ]+vs _(1,2) [h ₃ h ₄])S ₁+(vs _(2,1) [h ₁ h ₂ ]+vs _(2,2) [h ₃ h ₄])S ₂ +W=[{tilde over (h)} _(1,1) {tilde over (h)} _(1,2) ]S ₁ +[{tilde over (h)} _(2,1) {tilde over (h)} _(2,2) ]S ₂ +W  Equation 46

[0087] where S₁ and S₂ are the 2×2 STTD-encoded data blocks for {s_(1,1) s_(1,2)} and {s_(2,1) s_(2,2)}, where W is additive white noise, and where the following Equations 47 through 50 relate to the channel estimates:

{tilde over (h)} _(1,1) =vs _(1,1) h ₁ +vs _(1,2) h ₃  Equation 47

{tilde over (h)} _(1,2) =vs _(1,1) h ₂ +vs _(1,2) h ₄  Equation 48

{tilde over (h)} _(2,1) =vs _(2,1) h ₁ +vs _(2,2) h ₃  Equation 49

{tilde over (h)} _(2,2) =vs _(2,1) h ₂ +vs _(2,2) h ₄  Equation 50

[0088] The pilot symbol signals are shown as output from despreader 32″ to a channel estimator 82′, where as was the case for system 70 this illustration implies that the pilot symbols are spread, where the spreading will be with a different code than was used for the data symbols when the pilot symbols are in a separate channel and with the same code when the data and pilot symbols share the same channel. In any event, given the known values of the pilot symbols and the signals as received, channel estimator 82′ determines the value of Ĥ, as arising from Equations 47 through 50, above, and the values of that matrix are provided to STTD decoders 110 ₁ and 110 ₂. Each of decoders 110 ₁ and 110 ₂ performs the combining and block decoding for each data stream to generate sufficient statistics for symbol detection. In this regard, the channel estimate, Ĥ, and the basis selected for the previous transmission, V^((n))(t−1), are used for combining. The current channel estimate, Ĥ, is then used by block 84′ for selecting the basis V^((n)) from a set of bases, after which an identification of the selected basis V^((n)) is fed back to feedback decode block 78′ of transmitter 102. Additionally, the outputs of decoders 110 ₁ and 110 ₂ are connected to a joint interference cancellation and detector block 88′, which may implement any one of the various techniques described above with respect to the comparable block 88 in FIG. 3. Here again, note that the operation of block 88′ is a linear function, as is the operation of STTD decoders 110 ₁ and 110 ₂. Accordingly, the order of these two operations may be reversed and, thus, the ordering as shown in FIG. 4 is only by way of example. In any event, due to the operation of block 88′, the effect of inter-stream interference from the signals is suppressed with the result coupled to a parallel-to-serial connector 34″. Parallel-to-serial connector 34″ converts the P/2 streams back to a single stream. Lastly, this single stream is connected to blocks 36′″, 38′″, and 40′″, which operate in a comparable manner as described earlier with respect to blocks 36″, 38″, and 40″, respectively, of system 70 in FIG. 3.

[0089] Returning now to discuss V^((n)) basis selector block 84′, it operates in a comparable manner as described above with respect to block 84 of system 70 in that it selects an optimum linear basis transformation matrix V^((n)) from a finite set of those bases, where it uses a certain criterion or criteria (e.g., maximizing SINR or SNR, joint cancellation and detector type) to select that optimum basis. However, two notable changes exist for system 100. First, since 4×4 matrices are involved due to the double STTD encoding, then the precise format of Equations 29 and 35 are not used. Second, since system 100 is based on STTD communications, then an additional permutation approach is usable for establishing the finite set of liner basis transformation matrices. Each of these approaches is detailed below.

[0090] One set of linear basis transformation matrices from which V^((n)) basis selector block 84′ may select may be derived from Equation 29, by defining a Kronecker product of the matrix of Equation 29 with the identity matrix as shown in the following Equation 51: $\begin{matrix} {V^{(n)} = {{\begin{bmatrix} {\cos \quad \theta_{n}} & {{- \sin}\quad \theta_{n}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{bmatrix} \otimes \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}} = {\quad\left\lbrack \left. \quad\begin{matrix} {\cos \quad \theta_{n}} & 0 & {{- \sin}\quad \theta_{n}} & 0 \\ 0 & {\cos \quad \theta_{n}} & 0 & {{- \sin}\quad \theta_{n}} \\ {\sin \quad \theta_{n}} & 0 & {\cos \quad \theta_{n}} & 0 \\ 0 & {\sin \quad \theta_{n}} & 0 & {\cos \quad \theta_{n}} \end{matrix} \right\rbrack \right.}}} & {{Equation}\quad 51} \end{matrix}$

[0091] where θ_(n) is again defined by Equation 30. Looking at the 4×4 result of Equation 51, it may be seen that only θ_(n) is at issue. Thus, according to Equation 30, again receiver 104 need only transmit n back to transmitter 102 in order to identify which matrix V^((n)) provides the optimum SINR (or SNR); accordingly, only log₂(N) bits are required in the feedback channel to achieve this communication.

[0092] Another set of linear basis transformation matrices from which V^((n)) basis selector block 84′ may select may be derived from Equation 35, again by defining a Kronecker product, but this time between the matrix of Equation 35 with the identity matrix as shown in the following Equation 52: $\begin{matrix} {V^{(n)} = {{\begin{bmatrix} {\cos \quad \theta_{n}^{{j\varphi}_{m}}} & {{- \sin}\quad \theta_{n}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{bmatrix} \otimes \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}} = {\quad{= \quad {\quad\left\lbrack \quad \left. \quad\quad \begin{matrix} {\cos \quad \theta_{n}^{{j\varphi}_{m}}} & 0 & {{- \sin}\quad \theta_{n}^{{j\varphi}_{m}}} & 0 \\ 0 & {\cos \quad \theta_{n}^{{j\varphi}_{m}}} & 0 & {{- \sin}\quad \theta_{n}^{{j\varphi}_{m}}} \\ {\sin \quad \theta_{n}} & 0 & {\cos \quad \theta_{n}} & \quad \\ 0 & {\sin \quad \theta_{n}} & 0 & {\cos \quad \theta_{n}} \end{matrix}\quad \right\rbrack \right.}}}}} & {{Equation}\quad 52} \end{matrix}$

[0093] where θ_(n) is defined by Equation 36 and where φ_(m) is defined by Equation 37. Thus, according to Equation 52, receiver 104 need only transmit n and m back to transmitter 102 in order to identify which matrix V^((n)) provides the optimum SINR (or SNR); accordingly, only log₂(N)+log₂(M) bits are required in the feedback channel to achieve this communication.

[0094] Another set of linear basis transformation matrices from which V^((n)) basis selector block 84′, and which arises due to the use of STTD encoding, is the use of a set of permutation matrices. Specifically, a set of permutation matrices may be defined based on the number of transmit antennas, P, where each matrix has P×P elements and is either the identity matrix I or an orthogonal permutation of that matrix, and the number N of permutation matrices is shown in the following Equation 53 and is defined for P=2: $\begin{matrix} {N = {\frac{P!}{{2!}\left( \frac{P}{2} \right)} = {\frac{4!}{{2!}2} = 6}}} & {{Equation}\quad 53} \end{matrix}$

[0095] Thus, from Equation 53, such six matrices are shown in the following Equations 54 through 59: $\begin{matrix} {\Pi_{1234} = \left\lbrack \quad \begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{matrix}\quad \right\rbrack} & {{Equation}\quad 54} \\ {\Pi_{1243} = \left\lbrack \quad \begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \end{matrix}\quad \right\rbrack} & {{Equation}\quad 55} \\ {\Pi_{1324} = \left\lbrack \quad \begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 \end{matrix}\quad \right\rbrack} & {{Equation}\quad 56} \\ {\Pi_{1342} = \left\lbrack \quad \begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \end{matrix}\quad \right\rbrack} & {{Equation}\quad 57} \\ {\Pi_{1423} = \left\lbrack \quad \begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 0 \end{matrix}\quad \right\rbrack} & {{Equation}\quad 58} \\ {\Pi_{1432} = \left\lbrack \quad \begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \end{matrix}\quad \right\rbrack} & {{Equation}\quad 59} \end{matrix}$

[0096] From Equations 54 through 59, it may be seen that in the example of system 100 of FIG. 4, the set {V^((n)}) _(n=1) ^(N) of basis matrices consists of a total of only six matrices. Once more, therefore, basis selector block 84′ identifies the one of those six matrices that meets a certain criterion or criteria and indicates that optimum matrix to transmitter 102.

[0097] Equations 51 through 59 have demonstrated that system 100 also may implement various different sets of liner basis transformation matrices in order to improve signal communications between transmitter 102 and receiver 104. Various additional observations also are noteworthy. As one observation, note that still other finite sets of such matrices may be developed by one skilled in the art. For example, a set consisting of general 4×4 unitary rotation matrices may be ascertained. As another observation, recall that earlier in connection with Equation 39 it was stated that at most four unique non-zero values are included in each matrix V^((n)). This statement now may be confirmed by examining the matrices in Equations 51 and 52. For example, with respect to Equation 51, its 4×4 matrix includes only the following three non-zero values: (1) cos θ_(n); (2) −sin θ_(n); and (3) sin θ_(n). As another example, with respect to Equation 52, its 4×4 matrix includes at most only the following four non-zero values: (1) cos θ_(n)e^(jΦm); (2) −sin θ_(n); (3) sin θ_(n); and (4) cos θ_(n). Due to the fact that less than sixteen non-zero values are implemented in these as well as other example, then the number of bits required to feedback an identification of a selected matrix V^((n)) is less than might be required if sixteen different non-zero values were used.

[0098] From the above, it may be appreciated that the above embodiments provide a wireless communications systems having a transmitter and a receiver, both with multiple antennas. Various embodiments are described by way of example, wherein the transmitter communicates independent symbol stream, and prior to transmission, those streams are transformed using a linear basis; preferably the linear basis is selected by the receiver from a finite set of different bases and an identification of the selected basis, along with any parameter(s) corresponding to that basis, are communicated (i.e., fed back) from the receiver to the transmitter. Given the preceding, various benefits arise over the prior art as well as the above-discussed proposed eigenmode system. For example, recalling that the full channel eigenmode scheme would require 16×N_(Q) feedback bits, the preferred embodiment described herein in some approaches requires only log₂(N) feedback bits, and typically N should not exceed 16 so that therefore the number of feedback bits may be considerably lower than the eigenmode system. In addition, the preferred embodiments permit interstream interference which is subsequently accommodated using one of various joint detection methodologies. As still another benefit as compared to the largest eigenmode scheme, for a given modulation scheme the preferred embodiments allow higher data rates. Also, for a given data rate, the preferred embodiments allow the use of lower order constellation. Still further, the preferred embodiments may favor well in comparison to conventional closed-loop transmit diversity which requires 3×N_(Q) feedback coefficients. Still further, as compared to open loop systems, the preferred embodiments use channel information at the channel at the transmitter, which results in significant performance improvement, especially in slow fading channels. As a final benefit, the preceding teachings may be applied to various wireless systems given the many variations described herein and, thus, while the present embodiments have been described in detail, various substitutions, modifications or alterations could be made to the descriptions set forth above without departing from the inventive scope which is defined by the following claims. 

1. A wireless receiver for receiving signals from a transmitter, the transmitter comprising a plurality of transmit antennas for transmitting the signals which comprise respective streams of independent symbols and wherein interference occurs between the respective streams, the receiver comprising: a plurality of receive antennas for receiving the signals as influenced by a channel effect between the receiver and the transmitter; circuitry for multiplying the signals times a conjugate transpose of an estimate of the channel effect and times a conjugate transpose of a linear basis transformation matrix; circuitry for selecting the linear basis transformation matrix from a finite set of linear basis transformation matrices; and circuitry for removing the interference between the respective streams.
 2. The receiver of claim 1 and further comprising circuitry for determining the estimate of the channel effect, and wherein the circuitry for selecting selects the linear basis transformation matrix in response to the estimate of the channel effect.
 3. The receiver of claim 1 wherein the circuitry for selecting comprises: circuitry for determining a signal-to-interference-noise ratio corresponding to each matrix in the finite set and to each of the streams; and circuitry for selecting the linear basis transformation matrix as corresponding to an optimum determined signal-to-interference-noise ratios.
 4. The receiver of claim 3 wherein each signal-to-interference-noise ratio is determined in response to the estimate of the channel effect.
 5. The receiver of claim 3 wherein the circuitry for removing the interference between the respective streams is selected from a group consisting of circuitry for zero forcing and circuitry for determining a minimum mean square error.
 6. The receiver of claim 5 wherein the circuitry for removing the interference between the respective streams is selected from a group consisting of iterative and linear.
 7. The receiver of claim 3 wherein the circuitry for removing the interference between the respective streams comprises maximum likelihood detection circuitry.
 8. The receiver of claim 3 wherein the circuitry for selecting comprises circuitry for identifying a minimum of the signal-to-interference-noise ratios corresponding to each matrix in the finite set, and wherein the circuitry for selecting selects the linear basis transformation matrix as corresponding to a maximum of the identified minimums.
 9. The receiver of claim 3 wherein the circuitry for selecting comprises circuitry for minimizing a mean square error of the signal-to-interference-noise ratios corresponding to each matrix in the finite set.
 10. The receiver of claim 1 and further comprising circuitry for communicating an identification of the linear basis transformation matrix to the transmitter via a feedback channel.
 11. The receiver of claim 10: wherein the finite set consists of a number N matrices; and wherein the circuitry for communicating is operable to communicate the linear basis transformation matrix to the transmitter via a feedback channel by transmitting a number of bits equal to log₂(N) bits to the transmitter.
 12. The receiver of claim 11 wherein N is less than or equal to
 16. 13. The receiver of claim 1 wherein each matrix in the finite set of linear basis transformation matrices is operable for performing a rotation by the transmitter of the symbols.
 14. The receiver of claim 1 wherein each matrix in the finite set of linear basis transformation matrices is operable for performing a rotation and phase change by the transmitter of the symbols.
 15. The receiver of claim 1 wherein each matrix in the finite set of linear basis transformation matrices comprises a form of $V^{(n)} = {\left\lbrack \quad \begin{matrix} {\cos \quad \theta_{n}} & {{- \sin}\quad \theta_{n}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{matrix}\quad \right\rbrack.}$


16. The receiver of claim 1 wherein each matrix in the finite set of linear basis transformation matrices comprises a form of $V^{(n)} = {\left\lbrack \quad \begin{matrix} {\cos \quad \theta_{n}^{j\quad \varphi \quad m}} & {{- \sin}\quad \theta_{n}^{j\quad \varphi \quad m}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{matrix}\quad \right\rbrack.}$


17. The receiver of claim 1 wherein each matrix in the finite set of linear basis transformation matrices comprises a permutation of a first matrix.
 18. The receiver of claim 17 wherein the first matrix comprises an identity matrix.
 19. The receiver of claim 1 wherein the circuitry for multiplying comprises space time block coded decoding circuitry.
 20. The receiver of claim 1 wherein the circuitry for selecting comprises: circuitry for determining a signal-to-noise ratio corresponding to each matrix in the finite set and to each of the streams; and circuitry for selecting the linear basis transformation matrix as corresponding to an optimum determined signal-to-noise ratio.
 21. The receiver of claim 1 and further comprising circuitry for determining the estimate of the channel effect in response to pilot symbols received from the transmitter.
 22. The receiver of claim 1 wherein the circuitry for removing the interference between the respective streams is selected from a group consisting of circuitry for zero forcing, circuitry for determining a minimum mean square error, and circuitry for determining a maximum likelihood.
 23. The receiver of claim 1 wherein the signals comprise CDMA signals and further comprising circuitry for despreading the CDMA signals.
 24. The receiver of claim 1 wherein the signals comprise TDMA signals.
 25. The receiver of claim 1 wherein the symbols are selected from a group consisting of quadrature phase shift keying symbols, binary phase shift keying symbols, and quadrature amplitude modulation symbols.
 26. The receiver of claim 1 wherein the circuitry for multiplying the signals times a conjugate transpose of an estimate of the channel effect comprises a space time block coded transmit antenna diversity decoder.
 27. The receiver of claim 1 wherein the plurality of transmit antennas and the plurality of receive antennas are a same number of antennas.
 28. The receiver of claim 27 wherein the same number equals two.
 29. The receiver of claim 1 wherein the plurality of transmit antennas are less in number than the plurality of receive antennas.
 30. The receiver of claim 1 and further comprising: a demodulator coupled to receive an output from the circuitry for multiplying; a deinterleaver coupled to receive an output of the demodulator; and a decoder coupled to receive an output of the deinterleaver.
 31. A wireless communication system, comprising: a transmitter comprising a plurality of transmit antennas for transmitting signals which comprise respective streams of independent symbols and wherein interference occurs between the respective streams; and a receiver for receiving signals from a transmitter, the transmitter comprising a plurality of transmit antennas for transmitting the signals which comprise respective streams of independent symbols and wherein interference occurs between the respective streams, the receiver comprising: a plurality of receive antennas for receiving the signals as influenced by a channel effect between the receiver and the transmitter; circuitry for multiplying the signals times a conjugate transpose of an estimate of the channel effect and times a conjugate transpose of a linear basis transformation matrix; circuitry for selecting the linear basis transformation matrix from a finite set of linear basis transformation matrices; and circuitry for removing the interference between the respective streams.
 32. The system of claim 31 wherein the receiver further comprises circuitry for determining the estimate of the channel effect, and wherein the circuitry for selecting selects the linear basis transformation matrix in response to the estimate of the channel effect.
 33. The system of claim 31 wherein the receiver further comprises: circuitry for determining a signal-to-interference-noise ratio corresponding to each matrix in the finite set and to each of the streams; and circuitry for selecting the linear basis transformation matrix as corresponding to an optimum determined signal-to-interference-noise ratios.
 34. The system of claim 31 wherein each matrix in the finite set of linear basis transformation matrices is operable for performing a rotation by the transmitter of the symbols.
 35. The system of claim 31 wherein each matrix in the finite set of linear basis transformation matrices is operable for performing a rotation and phase change by the transmitter of the symbols.
 36. The receiver of claim 31 wherein each matrix in the finite set of linear basis transformation matrices comprises a permutation of a first matrix.
 37. The system of claim 31 wherein the receiver further comprises circuitry for communicating an identification of the linear basis transformation matrix to the transmitter via a feedback channel.
 38. The system of claim 37 wherein the transmitter further comprises circuitry for multiplying the respective streams of independent symbols times the identified linear basis transformation matrix.
 39. A method of operating a wireless receiver, comprising: receiving signals at a plurality of receive antennas and transmitted from a transmitter, the transmitter comprising a plurality of transmit antennas for transmitting the signals which comprise respective streams of independent symbols and wherein interference occurs between the respective streams and wherein the received signals are influenced by a channel effect between the receiver and the transmitter; multiplying the signals times a conjugate transpose of an estimate of the channel effect and times a conjugate transpose of a linear basis transformation matrix; selecting the linear basis transformation matrix from a finite set of linear basis transformation matrices; and removing the interference between the respective streams.
 40. The method of claim 39 and further comprising determining the estimate of the channel effect, and wherein the step of selecting selects the linear basis transformation matrix in response to the estimate of the channel effect.
 41. The method of claim 39 wherein the step of selecting comprises: determining a signal-to-interference-noise ratio corresponding to each matrix in the finite set and to each of the streams; and selecting the linear basis transformation matrix as corresponding to an optimum determined signal-to-interference-noise ratios.
 42. A wireless transmitter for transmitting signals to a receiver, comprising: a plurality of transmit antennas for transmitting the signals, the signals comprising respective streams of independent symbols and wherein interference occurs between the respective streams; circuitry for multiplying symbols times a linear basis transformation matrix, wherein the signals are responsive to the multiplication times a linear basis transformation matrix; and circuitry for selecting the linear basis transformation matrix in response to a communication received by the transmitter from the receiver via a feedback channel.
 43. The wireless transmitter of claim 42 wherein the receiver comprises: circuitry for selecting the linear basis transformation matrix; and circuitry for providing the communication to the transmitter via the feedback channel.
 44. The wireless transmitter of claim 43 wherein the circuitry for selecting the linear basis transformation matrix selects from a finite set of linear basis transformation matrices.
 45. The wireless transmitter of claim 44: wherein the finite set consists of a number N matrices; and wherein the communication consists of a number of bits equal to log₂(N) bits to the transmitter.
 46. The wireless transmitter of claim 45 wherein N is less than or equal to
 16. 47. The wireless transmitter of claim 42 wherein the linear basis transformation matrix is operable for performing a rotation by the transmitter of the symbols.
 48. The wireless transmitter of claim 42 wherein the linear basis transformation matrix is operable for performing a rotation and phase change of the symbols.
 49. The wireless transmitter of claim 42 wherein the linear basis transformation matrix comprises a form of $V^{(n)} = {\left\lbrack \quad \begin{matrix} {\cos \quad \theta_{n}} & {{- \sin}\quad \theta_{n}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{matrix}\quad \right\rbrack.}$


50. The wireless transmitter of claim 42 wherein the linear basis transformation matrix comprises a form of $V^{(n)} = {\left\lbrack \quad \begin{matrix} {\cos \quad \theta_{n}^{j\quad \varphi \quad m}} & {{- \sin}\quad \theta_{n}^{j\quad \varphi \quad m}} \\ {\sin \quad \theta_{n}} & {\cos \quad \theta_{n}} \end{matrix}\quad \right\rbrack.}$


51. The wireless transmitter of claim 42 wherein the linear basis transformation matrix comprises a permutation of a first matrix.
 52. The wireless transmitter of claim 51 wherein the first matrix comprises an identity matrix.
 53. The wireless transmitter of claim 42 and further comprising circuitry for space time block coded encoding the symbols.
 54. The wireless transmitter of claim 42 wherein the signals comprise CDMA signals and further comprising circuitry for spreading the CDMA signals.
 55. The wireless transmitter of claim 42 wherein the signals comprise TDMA signals.
 56. The wireless transmitter of claim 42 wherein the symbols are selected from a group consisting of quadrature phase shift keying symbols, binary phase shift keying symbols, and quadrature amplitude modulation symbols.
 57. The wireless transmitter of claim 42: wherein the receiver comprises a plurality of receive antennas; and wherein the plurality of transmit antennas and the plurality of receive antennas are a same number of antennas.
 58. The wireless transmitter of claim 57 wherein the same number equals two.
 59. The wireless transmitter of claim 57 wherein the plurality of transmit antennas are less in number than the plurality of receive antennas. 